Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
نویسندگان
چکیده
منابع مشابه
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong locality of mutex constraints observed in many benchmarks of the Fourth International Planning Competition (IPC4), we propose to partition the constraints of a planning problem into groups based on their subgoals. Con...
متن کاملSGPlan: Subgoal Partitioning and Resolution in Planning
We have developed SGPlan, a planner that competes in the Fourth International Planning Competition. SGPlan partitions a large planning problem into subproblems, each with its own subgoal, and resolves inconsistent solutions of subgoals using our extended saddle-point condition. Subgoal partitioning is effective because each partitioned subproblem involves a substantially smaller search space th...
متن کاملSubgoal Partitioning and Resolution in SGPlan∗
In this demo, we illustrate the idea and operations of SGPlan (Chen, Hsu, & Wah 2004; Wah & Chen 2005), a PDDL2.2 planner that won the first prize in the suboptimal temporal metric track and a second prize in the suboptimal propositional track in the Fourth International Planning Competition (IPC4), 2004. SGPlan is the only planner that won in two tracks of the competition. Since SGPlan is a su...
متن کاملSubgoal Partitioning and Global Search for Solving Temporal Planning Problems in Mixed Space
We study in this paper the partitioning of the constraints of a temporal planning problem by subgoals, their sequential evaluation before parallelizing the actions, and the resolution of inconsistent global constraints across subgoals. Using an l1-penalty formulation and the theory of extended saddle points, we propose a global-search strategy that looks for local minima in the original-variabl...
متن کاملHandling Soft Constraints and Goals Preferences in SGPlan∗
In this paper, we present the partition-and-resolve strategy in SGPlan (hereafter called SGPLan5) for fully supporting all language features in PDDL3.0. Based on the architecture of SGPlan that supported PDDL2.2 (hereafter called SGPLan4), SGPLan5 partitions a large planning problem into subproblems, each with its own subgoal, and resolves those inconsistent solutions using our extended saddle-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2006
ISSN: 1076-9757
DOI: 10.1613/jair.1918